Knots in the canonical book representation of complete graphs
نویسندگان
چکیده
منابع مشابه
heterogeneity within the orientalist discourse: representation of the orient in womens travelogues and mens paintings
from 1950s onward, new theories and critical approaches burgeoned across humanities. these theories were context-oriented; as a result, the analysis of discursive practices gained significance. thus, social, political, historical and cultural discourses that have been hitherto marginalized and considered inferior to literary texts, were introduced as important texts to be analyzed by critics. o...
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملBook drawings of complete bipartite graphs
4 We recall that a book with k pages consists of a straight line (the spine) and k half5 planes (the pages), such that the boundary of each page is the spine. If a graph is drawn 6 on a book with k pages in such a way that the vertices lie on the spine, and each edge 7 is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). 8 The pagenumber of a graph G is the ...
متن کاملInterval Graphs: Canonical Representation in Logspace
We present a logspace algorithm for computing a canonical interval representation and a canonical labeling of interval graphs. As a consequence, the isomorphism and automorphism problems for interval graphs are solvable in logspace.
متن کاملRepresentation numbers of complete multipartite graphs
A graph G has a representation modulo r if there exists an injective map f : V (G)→ {0, 1, ..., r − 1} such that vertices u and v are adjacent if and only if f(u) − f(v) is relatively prime to r. The representation number rep(G) is the smallest r such that G has a representation modulo r. Following earlier work on stars, we study representation numbers of complete bipartite graphs and more gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2013
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2013.6.65